Parametric Model-Checking of Stopwatch Petri Nets

نویسندگان

  • Louis-Marie Traonouez
  • Didier Lime
  • Olivier H. Roux
چکیده

At the border between control and verification, parametric verification can be used to synthesize constraints on the parameters to ensure that a system verifies given specifications. In this paper we propose a new framework for the parametric verification of time Petri nets with stopwatches. We first introduce a parametric extension of time Petri nets with inhibitor arcs (ITPNs) with temporal parameters and we define a symbolic representation of the parametric state-space based on the classical state-class graph method. Then, we propose semi-algorithms for the parametric modelchecking of a subset of parametric TCTL formulae on ITPNs. These results have been implemented in the tool Romeo and we illustrate them in a case-study based on a scheduling problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches

Last time we reported on Romeo, analyses with this tool were mostly based on translations to other tools. This new version provides an integrated TCTL model-checker and has gained in expressivity with the addition of parameters. Although there exists other tools to compute the state-space of stopwatch models, Romeo is the first one that performs TCTL model-checking on stopwatch models. Moreover...

متن کامل

Symbolic Unfolding of Parametric Stopwatch Petri Nets

We address the problem of unfolding safe parametric stopwatch time Petri nets (PSwPNs), i.e., safe time Petri nets (TPNs) possibly extended with time parameters and stopwatches. We extend the notion of branching process to account for the dates of the occurrences of events and thus define a symbolic unfolding for PSwPNs. In the case of TPNs we also propose a method based on our so-called time b...

متن کامل

SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets

Formal methods among them the model checking techniques play an important role in the design and production of both systems and software. In this paper we deal with an adaptation of the bounded model checking methods for timed systems, developed for timed automata, to the case of time Petri nets. We consider distributed time Petri nets and parametric reachability checking, but the approach can ...

متن کامل

Vérification et dépliages de réseaux de Petri temporels paramétrés. (Model-checking and unfoldings of parametric time Petri nets)

The research works presented concern the study of parameterized verificationmethods for real time systems. The aim is to propose formal methods that can be appliedon systems whose specifications are not yet completely defined. To that end, parameters areintroduced into the formal models in order to add some degrees of freedom. The goal is thento guide the conception of the syste...

متن کامل

Bounded Parametric Model Checking for Elementary Net Systems

Bounded Model Checking (BMC) is an efficient verification method for reactive systems. BMC has been applied so far to verification of properties expressed in (timed) modal logics, but never to their parametric extensions. In this talk we show, for the first time, that BMC can be extended to PRTECTL – the parametric extension of the existential version of CTL. To this aim we define a bounded sem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2009